Missverstehen als produktive Kraft

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Produktive Wissensarbeit

Dieser Beitrag beschreibt die Notwendigkeit der Konzentration auf Bedürfnisse, unterschiedliche Perspektiven und Barrieren von WissensarbeiterInnen. Die Kernaussage des Artikels: Das Verhältnis zwischen Führung, Management und Wissensarbeit bedarf eines Paradigmenwechsels.

متن کامل

Kraft - Chaitin Inequality

Kraft’s inequality [9] is essential for the classical theory of noiseless coding [1, 8]. In algorithmic information theory [5, 7, 2] one needs an extension of Kraft’s condition from finite sets to (infinite) recursively enumerable sets. This extension, known as Kraft-Chaitin Theorem, was obtained by Chaitin in his seminal paper [4] (see also, [3, 2], [10]). The aim of this note is to offer a si...

متن کامل

Kraft-chaitin Inequality Revisited 1

Kraft's inequality [9] is essential for the classical theory of noiseless coding [1, 8]. In algorithmic information theory [5, 7, 2] one needs an extension of Kraft's condition from nite sets to (in nite) recursively enumerable sets. This extension, known as Kraft-Chaitin Theorem, was obtained by Chaitin in his seminal paper [4] (see also, [3, 2]). The aim of this note is to o er a simpler proo...

متن کامل

Kraft: An Agent Architecture for Knowledge Fusion

Knowledge fusion refers to the process of locating and extracting knowledge from multiple, heterogeneous on-line sources, and transforming it so that the union of the knowledge can be applied in problem-solving. The KRAFT project has defined a generic agent-based architecture to support fusion of knowledge in the form of constraints expressed against an object data model. KRAFT employs three ki...

متن کامل

Lecture 7 : Prefix codes , Kraft - McMillian Inequality

In the previous lecture, we showed that Shannon constructed a code, which was a one-to-one mapping, that took a stream of data X = (X1, ..., Xn) generated iid from a distribution P (X) over a finite alphabet A = (a1, ..., aA) of size A, and compressed it using ≈ nH(X) bits in total or ≈ H(X) bits per symbol, on average (for sufficiently large n). The code was based considering a special subset ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: itw : im dialog

سال: 2017

ISSN: 2297-6523

DOI: 10.16905/itwid.2016.20.